Variationally scheduled quantum simulation

Eigenstate preparation is ubiquitous in quantum computing, and a standard approach for generating the lowest-energy states of given system by employing adiabatic state (ASP). In present work, we investigate variational method determining optimal scheduling procedure within context ASP. absence error correction, running device any meaningful amount time causes to become susceptible loss relevant information. Therefore, if accurate are be successfully generated, it crucial find techniques that shorten individual runs during iterations annealing. We demonstrate our toward this end investigating hydrogen P4 molecules, as well Ising model problem on two-dimensional triangular lattice. both cases, required one iteration produce results reduced several orders magnitude comparison what achievable via The significant shortening achieved using excited partially As result, coherence perform such calculation becomes much less stringent with implementation algorithm. addition, found exhibit resilience against control errors, which commonly encountered realm computing.